Monomial Characters of Finite Groups

نویسندگان

  • John McHugh
  • Matt Welz
چکیده

An abundance of information regarding the structure of a finite group can be obtained by studying its irreducible characters. Of particular interest are monomial characters — those induced from a linear character of some subgroup — since Brauer has shown that any irreducible character of a group can be written as an integral linear combination of monomial characters. Our primary focus is the class of M-groups, those groups all of whose irreducible characters are monomial. A classical theorem of Taketa asserts that an M-group is necessarily solvable, and Dade proved that every solvable group can be embedded as a subgroup of an M-group. After discussing results related to M-groups, we will construct explicit families of solvable groups that cannot be embedded as subnormal subgroups of any M-group. We also discuss groups possessing a unique non-monomial irreducible character, and prove that such a group cannot be simple.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Wedderburn decomposition of group algebras by the Brauer-Witt theorem

We present an alternative constructive proof of the Brauer–Witt theorem using the so-called strongly monomial characters that gives rise to an algorithm for computing the Wedderburn decomposition of semisimple group algebras of finite groups.

متن کامل

Bases for certain cohomology representations of the symmetric group

We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around the coordinate hyperplanes and trivial monodromy around all other hyperplanes. In the case where the local system is equivariant for the symmetric group, we ...

متن کامل

SOME NORMALLY MONOMIAL p-GROUPS OF MAXIMAL CLASS AND LARGE DERIVED LENGTH By L. G. KOVACS AND

1. A group of prime-power order p is obviously nilpotent of class at most m — 1; if it has class precisely m — 1, it is said to be of maximal class. The derived length of a p-group of maximal class is bounded by log2(3p-3) if p is odd and by 2 if p = 2. Indeed, if m ^ 9 p 4 0 , the derived length is at most 3 (Shepherd [6], Leedham-Green and McKay [5].) The question of whether there is an uncon...

متن کامل

Some connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups

‎Let $G$ be a finite group‎. ‎We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$‎. ‎In this paper we characterize solvable groups $G$ in which the derived covering number is finite‎.‎ 

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016